Logic Programming, Substitutions and Finite Computability

Inherently Reversible Grammars, Logic Programming And Computability

This paper a t tempts to clarify two distinct notions of "reversibility": (i) Uniformity of implementation of parsing and generation, and (it) reversibility as an inherent (or intrinsic) property of grammars. On the one hand, we explain why grammars specified as definite programs (or the various related "unification grammars") lead to uniformity of implementation. On the other hand, we define d...

On Answer Substitutions in Logic Programming

Answer substitutions play a central role in logic programming. To support selective answer substitutions, we refine ∃x in goals into two different versions: the noisy version ∃ox and the silent version ∃x. The main difference is that only the instantiation in ∃ox will be recorded in the answer substitutions. Similarly for ∀x. In addition, we discuss the notion of don’t-care constants and don’t-...

Computability and Logic

Intuitionistic computability logic I

Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and “truth” is understood as algorithmic solvability, CL potentially offers a comprehensive logical b...

Intuitionistic computability logic

Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and “truth” is understood as algorithmic solvability, CL potentially offers a comprehensive logical b...